Search for: All records

A new version of the US National Science Foundation National Center forAtmospheric Research (NSF NCAR) thermosphere-ionosphere-electrodynamicsgeneral circulation model (TIEGCM) has been developed and released. Thispaper describes the changes and improvements of the new version 3.0since its last major release (2.0) in 2016. These include: 1) increasingthe model resolution in both the horizontal and vertical dimensions, aswell as the ionospheric dynamo solver; 2) upward extension of the modelupper boundary to enable more accurate simulations of the topsideionosphere and neutral density in the lower exosphere; 3) improvedparameterization for thermal electron heating rate; 4) resolvingtransport of minor species N(2D); 5) treating helium as a major species;6) parameterization for additional physical processes, such as SAPS andelectrojet turbulent heating; 7) including parallel ion drag in theneutral momentum equation; 8) nudging of prognostic fields near thelower boundary from external data; 9) modification to the NO reactionrate and auroral heating rate; 10) outputs of diagnostic analysis termsof the equations; 11) new functionalities enabling model simulations ofcertain recurrent phenomena, such as solar flares and eclipse. Wepresent examples of the model validation during a moderate storm andcompare simulation results by turning on/off new functionalities todemonstrate the related new model capabilities. Furthermore, the modelis upgraded to comply with the new computer software environment at NSFNCAR for easy installation and run setup and with new visualizationtools. Finally, the model limitations and future development plans arediscussed. 

AnIDK classifieris a computing component that categorizes inputs into one of a number of classes, if it is able to do so with the required level of confidence, otherwise it returns “I Don’t Know” (IDK).IDK classifier cascadeshave been proposed as a way of balancing the needs for fast response and high accuracy in classification-based machine perception. Efficient algorithms for the synthesis of IDK classifier cascades have been derived; however, the responsiveness of these cascades is highly dependent on the accuracy of predictions regarding the run-time behavior of the classifiers from which they are built. Accurate predictions of such run-time behavior is difficult to obtain for many of the classifiers used for perception. By applying thealgorithms using predictionsframework, we propose efficient algorithms for the synthesis of IDK classifier cascades that arerobustto inaccurate predictions in the following sense: the IDK classifier cascades synthesized by our algorithms have short expected execution durations when the predictions are accurate, and these expected durations increase only within specified bounds when the predictions are inaccurate. 

Abstract This paper introduces and evaluates a general construct for trading off accuracy and overall execution duration in classification-based machine perception problems—namely, the generalized IDK classifier cascade . The aim is to select the optimal sequence of classifiers required to minimize the expected (i.e. average) execution duration needed to achieve successful classification, subject to a constraint on quality, and optionally a latency constraint on the worst-case execution duration. An IDK classifier is a software component that attempts to categorize each input provided to it into one of a fixed set of classes, returning “I Don’t Know” (IDK) if it is unable to do so with the required level of confidence. An ensemble of several different IDK classifiers may be available for the same classification problem, offering different trade-offs between effectiveness (i.e. the probability of successful classification) and timeliness (i.e. execution duration). A model for representing such characteristics is defined, and a method is proposed for determining the values of the model parameters for a given ensemble of IDK classifiers. Optimal algorithms are developed for sequentially ordering IDK classifiers into an IDK cascade, such that the expected duration to successfully classify an input is minimized, optionally subject to a latency constraint on the worst-case overall execution duration of the IDK cascade. The entire methodology is applied to two real-world case studies. In contrast to prior work, the methodology developed in this paper caters for arbitrary dependences between the probabilities of successful classification for different IDK classifiers. Effective practical solutions are developed considering both single and multiple processors. 

Abstract A classifier is a software component, often based on Deep Learning, that categorizes each input provided to it into one of a fixed set of classes. An IDK classifier may additionally output “I Don’t Know” (IDK) for certain inputs. Multiple distinct IDK classifiers may be available for the same classification problem, offering different trade-offs between effectiveness, i.e. the probability of successful classification, and efficiency, i.e. execution time. Optimal offline algorithms are proposed for sequentially ordering IDK classifiers such that the expected duration to successfully classify an input is minimized, optionally subject to a hard deadline on the maximum time permitted for classification. Solutions are provided considering independent and dependent relationships between pairs of classifiers, as well as a mix of the two.